An Approximation Algorithm for Bounded Degree Deletion∗ Tom´aˇs Ebenlendr† Petr Kolman‡

Source URL: kam.mff.cuni.cz

• NP-complete problems
• Functional analysis
• Vertex cover
• Distribution
• Graph coloring
• Dominating set
• Maximal independent set

Summarizing and Understanding Large Graphs Danai Koutra1∗ , U Kang2 , Jilles Vreeken3 and Christos Faloutsos1 1 School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA 2

Source URL: eda.mmci.uni-saarland.de

• Graph theory
• Clique
• Bipartite graph
• Graph
• Degree
• Line graph
• Maximal independent set

Spreading Processes and Large Components in Ordered, Directed Random Graphs Paul Horn∗ Malik Magdon-Ismail

Source URL: web.cs.du.edu

• SL
• Logarithm
• Jnos Komls
• Maximal independent set

Improved Equilibrium Enumeration for Bimatrix Games Extended abstract June 30, 1998 Bernhard von Stengel

Source URL: www.maths.lse.ac.uk

• Polyhedra
• Game theory
• Computational geometry
• Polytopes
• Linear programming
• Vertex enumeration problem
• Bimatrix game
• Clique
• Independent set
• Polyhedron
• Maximal independent set
• Simplex

Distributed Verification and Hardness of Distributed ∗ Approximation Atish Das Sarma †

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• Spanning tree
• NP-complete problems
• Dominating set
• Minimum spanning tree
• Maximal independent set
• Matching
• Travelling salesman problem
• Shortest path problem
• Tree

Graph based Synthesis for Low power Combinational logic with a maximal/minimal disjoint Function Set ABSTRACT This paper discusses a new, systematic approach to the synthesis of a class of non-regenerative Boolean networ

Source URL: apt.cs.manchester.ac.uk

Qualifying exam, Spring 2006, DayLet φ : A → B be a homomorphism of commutative rings, and let pB ⊂ B be a maximal ideal. Set A ⊃ pA := φ−1 (pB ). (a) Show that pA is prime but in general non maximal. (b

Source URL: math.harvard.edu

Beeping a Maximal Independent Set Yehuda Afek1 , Noga Alon1,2 , Ziv Bar-Joseph3 , Alejandro Cornejo4 , Bernhard Haeupler4 , and Fabian Kuhn5 1 3

Source URL: ac.informatik.uni-freiburg.de

Generalised Dualities and Finite Maximal Antichains∗ (extended abstract) Jan Foniok1 Jaroslav Neˇsetˇril1

Source URL: iti.mff.cuni.cz

1 Discovering the Top-k Unexplained Sequences in Time-Stamped Observation Data Massimiliano Albanese, Cristian Molinaro, Fabio Persia, Antonio Picariello, V. S. Subrahmanian

Source URL: www.cs.umd.edu

• Mathematics
• Statistical models
• Graph theory
• Statistics
• Stochastic process
• Probability distribution
• Maximal independent set
• Sequence
• Dual space
• Probability
• Bayesian network